A new approach to computability on realnumbers
نویسندگان
چکیده
We introduce majorant computability of functions on reals. A structural theorem is proved, which connects the graph of a majorant{computable function with validity of a nite formula on the set of the hereditarily nite set HF( R) (where R is an elementary proper extension of standard real numbers). The class of majorant{computable functions in our approach include an interesting class of real total functions having meromorphic extension on C. This class in particular contains functions which are solutions of known di erential equations. The notion of a majorant{computable functional on the set of total majorant{computable real functions is de ned. As an example of a majorant{computable functional the Riemann integral is proposed. 1 Section
منابع مشابه
A Two-Layer Approach to the Computability and Complexity of Real Numbers
We present a new approach to computability of real numbers in which real functions have type-1 representations, which also includes the ability to reason about the complexity of real numbers and functions. We discuss how this allows efficient implementations of exact real numbers and also present a new real number system that is based on it.
متن کاملA programming approach to computability pdf
A Programming Approach to Computability. Enumeration and Universality of the Computable Functions. 4 The FOR in real programming languages. Computability and complexity are in some way the basics of what computer science is about.Computability and Complexity: From a Programming Perspective, Neil D. 1Dana Scott was an early proponent of programming approach to automata.Computability unit of the ...
متن کاملON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION
An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...
متن کاملEnumeration Reducibility and Computable Structure Theory
In classical computability theory the main underlying structure is that of the natural numbers or equivalently a structure consisting of some constructive objects, such as words in a finite alphabet. In the 1960’s computability theorists saw it as a challenge to extend the notion of computable to arbitrary structure. The resulting subfield of computability theory is commonly referred to as comp...
متن کاملIncorporating User Interaction into Imperative Languages
Abstract: Adding versatile interactions to imperative programming – C, Java and Android – is an essential task. Unfortunately, existing languages provide little constructs for user interaction. We propose a computability-logical approach [1] to user interaction. We illustrate our idea via C, an extension of the core C with a new choice statement. keywords: user interaction, choose, computabilit...
متن کامل